    #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int _mysort(vector<pair<int, int>>& vp, int l, int r)
{
    int pre = l, cur = l + 1;
    int key = l;
    while (cur <= r)
    {
        if (vp[cur].first < vp[key].first)
        {
            pre++;
            swap(vp[cur], vp[pre]);
        }
        cur++;
    }
    swap(vp[key], vp[pre]);
    return pre;
}
void mysort(vector<pair<int, int>>& vp, int left, int right)
{
    if (left > right)
        return;
    int mid = _mysort(vp, left, right);
    mysort(vp, left, mid - 1);
    mysort(vp, mid + 1, right);
}
int main()
{
    int n;
    cin >> n;
    int tmp;
    vector<pair<int, int>> vp(n);
    for (int i = 0; i < n; i++)
    {
        cin >> tmp;
        vp[i].first = tmp;
        vp[i].second = i + 1;
    }
    mysort(vp, 0, n - 1);
    for (auto it : vp)
    {
        cout << it.second << ' ';
    }
}